Order-incompleteness and finite lambda reduction models

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Order-incompleteness and finite lambda reduction models

Many familiar models of the untyped lambda calculus are constructed by order theoretic methods. This paper provides some basic new facts about ordered models of the lambda calculus. We show that in any partially ordered model that is complete for the theory of βor βη-conversion, the partial order is trivial on term denotations. Equivalently, the open and closed term algebras of the untyped lamb...

متن کامل

Order-Incompleteness and Finite Lambda Models (Extended Abstract)

Many familiar models of the type-free lambda calculus are constructed by order theoretic methods. This paper provides some basic new facts about ordered models of the lambda calculus. We show that in any partially ordered model that is complete for the theory ofβorβη-conversion, the partial order is trivial on term denotations. Equivalently, the open and closed term algebras of the type-free la...

متن کامل

Towards Lambda Calculus Order-Incompleteness

After Scott, mathematical models of the type-free lambda calculus are constructed by order theoretic methods and classiied into semantics according to the nature of their representable functions. Selinger 47] asked if there is a lambda theory that is not induced by any non-trivially partially ordered model (order-incompleteness problem). In terms of Alexandroo topology (the strongest topology w...

متن کامل

Topological Incompleteness and Order Incompleteness of the Lambda Calculus

A model of the untyped lambda calculus induces a lambda theory, i.e., a congruence relation on -terms closed under and -conversion. A semantics (= class of models) of the lambda calculus is incomplete if there exists a lambda theory which is not induced by any model in the semantics. In this paper we introduce a new technique to prove the incompleteness of a wide range of lambda calculus semant...

متن کامل

Model Order Reduction for Large Scale Finite Element Engineering Models

Software MOR for ANSYS has been developed at IMTEK in 2003. It allows us to perform model reduction directly to finite element models developed in ANSYS. The goal of the present paper is to describe progress achieved for the last two years and review our publications with application of MOR for ANSYS to various engineering problems for different domains: heat transfer, structural mechanics, the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2003

ISSN: 0304-3975

DOI: 10.1016/s0304-3975(02)00038-5